Step of Proof: comp_nat_ind_a
9,38
postcript
pdf
Inference at
*
1
I
of proof for Lemma
comp
nat
ind
a
:
1.
P
:
{k}
2.
i
:
. (
j
:
. (
j
<
i
)
P
(
j
))
P
(
i
)
3.
i
:
P
(
i
)
latex
by ((% Generalize %
Assert
j
,
s
:
. (
s
<
j
)
P
(
s
))
A
CollapseTHEN (IfLabL
AC
[`assertion`,Id
AC[`
;`main`,((InstHyp [
i
+ 1;
i
] (-1))
A
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 2:n
AC
),(first_nat 3:n)) (first_tok :t) inil_term)))
]))
latex
AC
1
: .....assertion..... NILNIL
AC1:
j
,
s
:
. (
s
<
j
)
P
(
s
)
AC
.
Definitions
False
,
A
,
A
B
,
t
T
,
P
Q
,
,
x
:
A
.
B
(
x
)
,
Lemmas
le
wf
origin